Genten's theorem on an extended predicate calculus
نویسندگان
چکیده
منابع مشابه
A Hybrid Predicate Calculus∗
We present the Hybrid Predicate Calculus (HPC), a hybrid logical system which incorporates a fairly conventional first-order predicate calculus, but which also include elements of modal logic and relational algebra. A special effort has been made to produce a (syntactically and semantically) well-integrated whole, rather than just a disjoint union. Our calculus, from a formal point of view, is ...
متن کاملNotes on Predicate Calculus and Logic Programming
[1] Apt, K. R.: Logic Programming, Handbook of Theoretical Computer Science (J. van Leeuwen, ed.), Elsevier Science Publishers B.V., 1990. [2] Chang, C.-L. and Lee, R. C.-T.: Symbolic Logic and Mechanical Theorem Proving, Academic Press Inc., 1973. [3] Kowalski, R.: Logic for Problem Solving, North Holland, 1979. [4] Lloyd, J. W.: Foundations of Logic Programming, 2nd Edition, Springer Verlag, ...
متن کاملNotes on Predicate Calculus and Logic Programming
[1] Apt, K. R.: Logic Programming, Handbook of Theoretical Computer Science (J. van Leeuwen, ed.), Elsevier Science Publishers B.V., 1990. [2] Chang, C.-L. and Lee, R. C.-T.: Symbolic Logic and Mechanical Theorem Proving, Academic Press Inc., 1973. [3] Kowalski, R.: Logic for Problem Solving, North Holland, 1979. [4] Lloyd, J. W.: Foundations of Logic Programming, 2nd Edition, Springer Verlag, ...
متن کاملAn Extended Expansion Theorem
Closed CCS (CCCS) is a CCS-like algebra of processes with a generalized form of prefixing based on a full-fledged algebra of transitions rather than on basic actions only. The basic idea is that the generalized prefixing operator takes a transition t, or rather its observation w, a process E and yields the process t.E. From an operational standpoint, the process t.E may evolve to E by performin...
متن کاملThe predicate calculus is complete∗
The first thing we need to do is to precisify the inference rules UI and EE. To this end, we will use A(c) to denote a sentence containing the name c, and we will use ∀vA(v) to denote the sentence that results from replacing all occurrences of c in A(c) with v and then putting the quantifier ∀v on the front. (We also require that the variable v did not already occur in A(c).) We use a similar c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Japan Academy, Series A, Mathematical Sciences
سال: 1954
ISSN: 0386-2194
DOI: 10.3792/pja/1195525871